GA-Hardness Revisited
نویسندگان
چکیده
Ever since the invention of Genetic Algorithms (GAs), researchers have put a lot of efforts into understanding what makes a function or problem instance hard for GAs to optimize. Many measures have been proposed to distinguish socalled GA-hard from GA-easy problems. None of these, however, has yet achieved the goal of being a reliable predictive GA-hardness measure. In this paper, we first present a general, abstract theoretical framework of instance hardness and algorithm performance based on Kolmogorov complexity. We then list several major misconceptions of GA-hardness research in the context of this theory. Finally, we propose some future directions.
منابع مشابه
Genetic Algorithms, and Hardness
Genetic algorithm (GA) researchers have long desired to describe the key characteristics of GA-hardness. Unfortunately this goal has remained largely unmet. In this paper, we describe a new way for evaluating GA-hardness that is based on the foundations of formal complexity theory. In particular, a GA-reduction is introduced. Using this reduction, we show that a reasonable definition of "GA-har...
متن کاملFitness Distributions and GA Hardness
Considerable research effort has been spent in trying to formulate a good definition of GA-Hardness. Given an instance of a problem, the objective is to estimate the performance of a GA. Despite partial successes current definitions are still unsatisfactory. In this paper we make some steps towards a new, more powerful way of assessing problem difficulty based on the properties of a problem's f...
متن کاملPractical Search Index as a Hardness Measure for Genetic Algorithms
Use of the Building Block Hypothesis to illuminate GA search behavior, as pursued by J. H. Holland and D. E. Goldberg, invites additional investigation.This paper investigates the space actually searched by a GA, in light of the Building Block Hypothesis, GA sampling and population size, in an effort to develop more quantitative measures of GA hardness for problems where building block sizes ca...
متن کاملHardness Optimization for Al6061-MWCNT Nanocomposite Prepared by Mechanical Alloying Using Artificial Neural Networks and Genetic Algorithm
Among artificial intelligence approaches, artificial neural networks (ANNs) and genetic algorithm (GA) are widely applied for modification of materials property in engineering science in large scale modeling. In this work artificial neural network (ANN) and genetic algorithm (GA) were applied to find the optimal conditions for achieving the maximum hardness of Al6061 reinforced by multiwall car...
متن کاملEffects of Ga addition on the mechanical properties of 35Ag-30Pd-20Au-15Cu alloy.
Ten 35Ag-30Pd-20Au-15Cu alloys containing 0.00, 0.25, 0.50, 0.75, 1.00, 1.25, 1.50, 2.00, 4.00, or 6.00% Ga were experimentally prepared to investigate the effect of Ga on their mechanical properties in addition to their use for denture frameworks, connectors and clasps. The effect of Ga addition on the mechanical properties was marked with a significant increase in the tensile strength, 0.2% o...
متن کامل